A proof-theoretic analysis of the classical propositional matrix method
نویسندگان
چکیده
منابع مشابه
A proof-theoretic analysis of the classical propositional matrix method
The matrix method, due to Bibel and Andrews, is a proof procedure designed for automated theorem-proving. We show that underlying this method is a fully structured combinatorial model of conventional classical proof theory.
متن کاملCategorical proof theory of classical propositional calculus
We investigate semantics for classical proof based on the sequent calculus. We show that the propositional connectives are not quite well-behaved from a traditional categorical perspective, and give a more refined, but necessarily complex, analysis of how connectives may be characterised abstractly. Finally we explain the consequences of insisting on more familiar categorical behaviour.
متن کاملClassical Propositional Decidability via Nuprl Proof Extraction
This paper highlights a methodology of Nuprl proof that re sults in e cient programs that are more readable than those produced by other established methods for extracting programs from proofs We de scribe a formal constructive proof of the decidability of a sequent calculus for classical propositional logic The proof is implemented in the Nuprl system and the resulting proof object yields a co...
متن کاملThe Model-Theoretic Expressiveness of Propositional Proof Systems
We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded width resolution, and the polynomial calculus of bounded degree, can be characterised in a precise sense by variants of fixed-point logics that are of fundamental import...
متن کاملA Finite-Model-Theoretic View on Propositional Proof Complexity
We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width resolution, and the polynomial calculus of bounded degree, can be characterised in a precise sense by variants of fixed-point logics that are of fundamental import...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2012
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/exs045